github.com/klauspost/compress/zstd.fastEncoder.table (field)

58 uses

	github.com/klauspost/compress/zstd (current package)
		enc_dfast.go#L49: 			e.table = [dFastShortTableSize]tableEntry{}
		enc_dfast.go#L56: 		for i := range e.table[:] {
		enc_dfast.go#L57: 			v := e.table[i].offset
		enc_dfast.go#L63: 			e.table[i].offset = v
		enc_dfast.go#L129: 			candidateS := e.table[nextHashS]
		enc_dfast.go#L135: 			e.table[nextHashS] = entry
		enc_dfast.go#L308: 		e.table[hashLen(cv0, dFastShortTableBits, dFastShortLen)] = te0
		enc_dfast.go#L309: 		e.table[hashLen(cv1, dFastShortTableBits, dFastShortLen)] = te1
		enc_dfast.go#L335: 			e.table[nextHashS] = entry
		enc_dfast.go#L382: 		for i := range e.table[:] {
		enc_dfast.go#L383: 			e.table[i] = tableEntry{}
		enc_dfast.go#L435: 			candidateS := e.table[nextHashS]
		enc_dfast.go#L441: 			e.table[nextHashS] = entry
		enc_dfast.go#L612: 		e.table[hashLen(cv0, dFastShortTableBits, dFastShortLen)] = te0
		enc_dfast.go#L613: 		e.table[hashLen(cv1, dFastShortTableBits, dFastShortLen)] = te1
		enc_dfast.go#L640: 			e.table[nextHashS] = entry
		enc_dfast.go#L689: 			for i := range e.table[:] {
		enc_dfast.go#L690: 				e.table[i] = tableEntry{}
		enc_dfast.go#L701: 		for i := range e.table[:] {
		enc_dfast.go#L702: 			v := e.table[i].offset
		enc_dfast.go#L708: 			e.table[i].offset = v
		enc_dfast.go#L775: 			candidateS := e.table[nextHashS]
		enc_dfast.go#L782: 			e.table[nextHashS] = entry
		enc_dfast.go#L963: 		e.table[hashVal1] = te0
		enc_dfast.go#L965: 		e.table[hashVal2] = te1
		enc_dfast.go#L993: 			e.table[nextHashS] = entry
		enc_fast.go#L28: 	table [tableSize]tableEntry
		enc_fast.go#L48: 			for i := range e.table[:] {
		enc_fast.go#L49: 				e.table[i] = tableEntry{}
		enc_fast.go#L56: 		for i := range e.table[:] {
		enc_fast.go#L57: 			v := e.table[i].offset
		enc_fast.go#L63: 			e.table[i].offset = v
		enc_fast.go#L126: 			candidate := e.table[nextHash]
		enc_fast.go#L127: 			candidate2 := e.table[nextHash2]
		enc_fast.go#L130: 			e.table[nextHash] = tableEntry{offset: s + e.cur, val: uint32(cv)}
		enc_fast.go#L131: 			e.table[nextHash2] = tableEntry{offset: s + e.cur + 1, val: uint32(cv >> 8)}
		enc_fast.go#L258: 			e.table[nextHash] = tableEntry{offset: s + e.cur, val: uint32(cv)}
		enc_fast.go#L307: 		for i := range e.table[:] {
		enc_fast.go#L308: 			e.table[i] = tableEntry{}
		enc_fast.go#L363: 			candidate := e.table[nextHash]
		enc_fast.go#L364: 			candidate2 := e.table[nextHash2]
		enc_fast.go#L367: 			e.table[nextHash] = tableEntry{offset: s + e.cur, val: uint32(cv)}
		enc_fast.go#L368: 			e.table[nextHash2] = tableEntry{offset: s + e.cur + 1, val: uint32(cv >> 8)}
		enc_fast.go#L498: 			e.table[nextHash] = tableEntry{offset: s + e.cur, val: uint32(cv)}
		enc_fast.go#L547: 			e.table = [tableSize]tableEntry{}
		enc_fast.go#L553: 		for i := range e.table[:] {
		enc_fast.go#L554: 			v := e.table[i].offset
		enc_fast.go#L560: 			e.table[i].offset = v
		enc_fast.go#L623: 			candidate := e.table[nextHash]
		enc_fast.go#L624: 			candidate2 := e.table[nextHash2]
		enc_fast.go#L627: 			e.table[nextHash] = tableEntry{offset: s + e.cur, val: uint32(cv)}
		enc_fast.go#L629: 			e.table[nextHash2] = tableEntry{offset: s + e.cur + 1, val: uint32(cv >> 8)}
		enc_fast.go#L758: 			e.table[nextHash] = tableEntry{offset: s + e.cur, val: uint32(cv)}
		enc_fast.go#L808: 	if len(e.dictTable) != len(e.table) || d != e.lastDict {
		enc_fast.go#L809: 		if len(e.dictTable) != len(e.table) {
		enc_fast.go#L810: 			e.dictTable = make([]tableEntry, len(e.table))
		enc_fast.go#L850: 		e.table = *(*[tableSize]tableEntry)(e.dictTable)
		enc_fast.go#L863: 		*(*[shardSize]tableEntry)(e.table[i*shardSize:]) = *(*[shardSize]tableEntry)(e.dictTable[i*shardSize:])